Minkowski units in certain metacyclic fields
نویسندگان
چکیده
منابع مشابه
Explicit formulas for units in certain quadratic number fields
There is a class of quadratic number fields for which it is possible to find an explicit continued fraction expansion of a generator and hence an explicit formula for the fundamental unit. One therewith displays a family of quadratic fields with relatively large regulator. The formula for the fundamental unit seems far simpler than the continued fraction expansion, yet the expansion seems neces...
متن کاملFibonacci lengths for certain metacyclic groups
For a finitely generated group G = 〈A〉 where A = {a1, a2, . . . , an} the sequence xi = ai+1, 0 ≤ i ≤ n − 1, xi+n = ∏n j=1 xi+j−1, i ≥ 0, is called the Fibonacci orbit of G with respect to the generating set A, denoted FA(G). If FA(G) is periodic we call the length of the period of the sequence the Fibonacci length of G with respect to A, written LENA(G). In this paper we examine the Fibonacci ...
متن کاملOn the real quadratic fields with certain continued fraction expansions and fundamental units
The purpose of this paper is to investigate the real quadratic number fields $Q(sqrt{d})$ which contain the specific form of the continued fractions expansions of integral basis element where $dequiv 2,3( mod 4)$ is a square free positive integer. Besides, the present paper deals with determining the fundamental unit$$epsilon _{d}=left(t_d+u_dsqrt{d}right) 2left.right > 1$$and $n_d$ and $m_d...
متن کاملOn the existence of Minkowski units in totally real cyclic fields
Let K be a totally real cyclic number field of degree n that is the product of two distinct primes and such that the class number of the n-th cyclotomic field equals 1. We derive certain necessary and sufficient conditions for the existence of a Minkowski unit for K.
متن کاملRecognizing Units in Number Fields
We present a deterministic polynomial-time algorithm that decides whether a power product n¿=i ff is a umt m tne ring of integers of K , where K isa number field, y, are nonzero elements of K and n¡ are rational integers. The main algorithm is based on the factor refinement method for ideals, which might be of independent interest.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1988
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-51-4-381-391